Linear functions preserving Green's relations over fields
نویسندگان
چکیده
We study linear functions on the space of n × matrices over a field which preserve or strongly each Green's equivalence relations ( L , R H and J ) corresponding pre-orders. For these we are able to completely describe all preservers an algebraically closed (or more generally, in every polynomial degree has root), strong bijective any field. Over general field, non-zero -preservers coincide with rank-1 preservers, while turn out be exactly invertibility known. The - “few roots” seem harder describe: give family examples showing that they can quite wild.
منابع مشابه
Linear Functions Preserving Multivariate and Directional Majorization
Let V and W be two real vector spaces and let &sim be a relation on both V and W. A linear function T : V → W is said to be a linear preserver (respectively strong linear preserver) of &sim if Tx &sim Ty whenever x &sim y (respectively Tx &sim Ty if and only if x &sim y). In this paper we characterize all linear functions T : M_{n,m} → M_{n,k} which preserve or strongly preserve multivariate an...
متن کاملLinear Functions Preserving Sut-Majorization on RN
Suppose $textbf{M}_{n}$ is the vector space of all $n$-by-$n$ real matrices, and let $mathbb{R}^{n}$ be the set of all $n$-by-$1$ real vectors. A matrix $Rin textbf{M}_{n}$ is said to be $textit{row substochastic}$ if it has nonnegative entries and each row sum is at most $1$. For $x$, $y in mathbb{R}^{n}$, it is said that $x$ is $textit{sut-majorized}$ by $y$ (denoted by $ xprec_{sut} y$) if t...
متن کاملZeta functions of equivalence relations over finite fields
We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over the finite field Fq . This is a consequence of the rationality of Weil zeta functions and of first-order formulas, together with the existence of a suitable parameter space for constructible families of constructible sets.
متن کاملOn the Generalized Linear Equivalence of Functions Over Finite Fields
In this paper we introduce the concept of generalized linear equivalence between functions defined over finite fields; this can be seen as an extension of the classical criterion of linear equivalence, and it is obtained by means of a particular geometric representation of the functions. After giving the basic definitions, we prove that the known equivalence relations can be seen as particular ...
متن کاملRational Functions with Linear Relations
We find all polynomials f, g, h over a field K such that g and h are linear and f(g(x)) = h(f(x)). We also solve the same problem for rational functions f, g, h, in case the field K is algebraically closed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2020.10.033